Ticket Entailment is decidable
نویسنده
چکیده
We prove the decidability of the logic T→ of Ticket Entailment. Raised by Anderson and Belnap within the framework of relevance logic, this question is equivalent to the question of the decidability of type inhabitation in simply-typed combinatory logic with the partial basis BBIW. We solve the equivalent problem of type inhabitation for the restriction of simply-typed lambda-calculus to hereditarily right-maximal terms.
منابع مشابه
Ticket Entailment plus the mingle axiom has the variable-sharing property
The logic TM is the result of adding the mingle axiom to Ticket Entailment logic, T. In the present paper, it is proved that TM has the variable-sharing property (vsp). Ternary relational semantics for TM is provided. Finally, an interesting extension of TM with the vsp is briefly discussed.
متن کاملCompleteness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly ordered sets of models of the underlying logic. This interpretation induces an entailment relation between sequence formulas which strongly depends on which orderings one wishes to consider. Some important classes are:...
متن کاملCombining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailment. We start from an abstract syntax that views a rule as a pair of rule graphs which generalize RDF graphs by also allowing rule variables in subject, predicate and object positions. We include RDFS as well as a decidable part of OWL that weakens D-entailment and OWL F...
متن کاملInternship report: Uniform and non-structural subtyping
We expose a new approach to tackle non-structural subtyping problems. We introduce uniform subtyping as a means to capture some properties of non-structural subtyping. In the uniform theory, we show that the validity of a first-order sentence is decidable, and entailment is PSPACEhard. In addition, we give decidable approximations to entailment and subtyping constrained types — two problems whi...
متن کاملTree-Like Grammars and Separation Logic
Separation Logic with inductive predicate definitions (SL) and hyperedge replacement grammars (HRG) are established formalisms to describe the abstract shape of data structures maintained by heap-manipulating programs. Fragments of both formalisms are known to coincide, and neither the entailment problem for SL nor its counterpart for HRGs, the inclusion problem, are decidable in general. We in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 23 شماره
صفحات -
تاریخ انتشار 2013